Novel Algorithms for the Accurate, Efficient, and Parallel Computation of Multidimensional, Regional Discrete Fourier Transforms
نویسنده
چکیده
A novel class of Discrete Fourier Transform algorithms is presented First, a new algorithm is presented for computing the DFT spectrum along any given direction. Then, computation of the entire DFT spectrum is computed using a minimal set of independent directions. It is shown that the new class of algorithms is both faster and more accurate than the traditional tensor decomposition of the DFT computation. Furthermore, the new algorithms allow for each direction to be computed independently of the others, hence allowing a parallel implementation.
منابع مشابه
Implementing 2-d and 3-d Discrete Hartley Transforms on a Massively Parallel Simd Mesh Computer
Discrete Hartley transform (DHT) is known to outperform fast Fourier transform (FFT) on sequential machines. Here we investigate parallel algorithms and implementations of twoand three-dimensional DHT in order to determine if the advantage of Hartley transforms over Fourier transforms carries over to parallel environment as well. Our extensive empirical study of the performances of DHT and FFT ...
متن کاملFast algorithms of multidimensional discrete nonseparable -wave transforms
Fast algorithms for a wide class of non–separable n–dimensional (nD) discrete unitary K– transforms (DKT) are introduced. They need less 1D DKTs than in the case of the classical radix–2 FFT–type approach. The method utilizes a decomposition of the nDK–transform into the product of a new nD discrete Radon transform and of a set of parallel/independ 1D K–transforms. If the nD K–transform has a s...
متن کاملSquare Lattice Elliptical- Core Photonic Crystal Fiber Soliton-Effect Compressor at 1550nm
In this paper, we investigate the evolution of supercontinuum and femtosecond optical pulses generation through square lattice elliptical-core photonic crystal fiber (PCF) at 1550 nm by using both full-vector multipole method (M.P.M) and novel concrete algorithms: symmetric split-step Fourier (SSF) and fourth order Runge Kutta (RK4) which is an accurate method to solve the general nonlinear...
متن کاملEfficient Quantum Transforms
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a generalized Kronecker product is given. Applications include re-development of the networks for computing the Walsh-Hadamard and the quantum Fourier transform...
متن کاملA Novel Method for Impedance Calculation of Distance Relays Using Third Order Interpolation
All algorithms for impedance calculation use an analog-to-digital converter. The high accuracy of the impedance seen by a distance relay is an important factor in the correct isolation of the faulty part of power systems. To achieve this, a novel
technique based on third order interpolation is used in this paper. According to this technique, the times and the values of the obtained samples a...
متن کامل